trace scheduling การใช้

• Trace scheduling is one of many known techniques for doing so.
• Trace scheduling was originally developed for Very Long Instruction Word, or VLIW machines, and is a form of global code motion.
• Trace scheduling uses a basic block scheduling method to schedule the instructions in each entire trace, beginning with the trace with the highest frequency.
• The practicality of trace scheduling was demonstrated by a compiler built at Yale by Fisher and three of his graduate students, John Ruttenberg, ELI ( Enormously Long Instructions ) Project.
• The first ST210 compiler was the HP Lx compiler developed at HP Labs Cambridge, itself a descendant of the Multiflow Trace scheduling compiler and heavily modified by HP to target the embedded domain.
• Trace scheduling is such a method, and involves scheduling the most likely path of basic blocks first, inserting compensating code to deal with speculative motions, scheduling the second most likely trace, and so on, until the schedule is complete.
• In addition to implementing aggressive trace scheduling, it was known for its reliability, for its incorporation of state-of-the-art object-code incompatible models of the Multiflow Traces . ( While code from a 7 / X00 could run correctly on a 14 / X00, the nature of the architecture mandated that it would have to be recompiled to run faster than it did on the 7 / .)